Periodic, reducible, powerful ray pattern matrices
نویسندگان
چکیده
منابع مشابه
Powers of Ray Pattern Matrices
We examine the similarities and differences between results for powers of sign pattern matrices and for powers of ray pattern matrices. In particular, we investigate what is known about k-potent patterns and powerful patterns in both the irreducible and reducible cases. 1 Signs, Rays, Sign & Ray Patterns Since at least the 1960’s, the qualitative theory of real matrices has been an extremely fr...
متن کاملStructural Pattern Recognitionby Non - Reducible
The classiication technique by Non-Reducible Descriptors provides decision rules in term of Boolean formulae on object's key features. In this paper we present an extension of the Non-Reducible Descriptors that contains quantitative information. By Quantitative Non-Reducible Descriptor of an object, the distance to the descriptions of objects from another classes is explicitly expressed. This f...
متن کاملMulticolor urn models with reducible replacement matrices
Consider the multicolored urn model where after every draw, balls of the different colors are added to the urn in proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not irreducible. For three and four color urns, we derive the asymptotic behavior of linear combinations of number of balls. In particular, we show that certain li...
متن کاملPeriodic GMP Matrices
We recall criteria on the spectrum of Jacobi matrices such that the corresponding isospectral torus consists of periodic operators. Motivated by those known results for Jacobi matrices, we define a new class of operators called GMP matrices. They form a certain Generalization of matrices related to the strong Moment Problem. This class allows us to give a parametrization of almost periodic fini...
متن کاملCounting Reducible Matrices, Polynomials, and Surface and Free Group Automorphisms
A. We give upper bounds on the numbers of various classes of polynomials reducible over Z and over Z/pZ, and on the number of matrices in SL(n),GL(n) and Sp(2n) with reducible characteristic polynomials, and on polynomials with non-generic Galois groups. We use our result to show that a random (in the appropriate sense) element of the mapping class group of a closed surface is pseudo-Ano...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2014
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.11.007